By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 9, Issue 2, pp. 167-348

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Finding a Domatic Partition of an Interval Graph in Time $O(n)$

Glenn K. Manacher and Terrance A. Mankus

pp. 167-172

On a Question of Erdös on Subsequence Sums

Don Coppersmith and Steven Phillips

pp. 173-177

Spanning Trees—Short or Small

R. Ravi, R. Sundaram, M. V. Marathe, D. J. Rosenkrantz, and S. S. Ravi

pp. 178-200

On the Nonexistence of Perfect Codes in the Johnson Scheme

Tuvi Etzion

pp. 201-209

A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems

Frank Hoffmann and Klaus Kriegel

pp. 210-224

Classifying Hyperplanes in Hypercubes

Oswin Aichholzer and Franz Aurenhammer

pp. 225-232

Packing Steiner Trees: Separation Algorithms

M. Grötschel, A. Martin, and R. Weismantel

pp. 233-257

On the Power of Democratic Networks

E. N. Mayoraz

pp. 258-268

Bounding Functions and Rigid Graphs

Michael O. Albertson and Ruth Haas

pp. 269-273

A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs

Binay Bhattacharya, Pavol Hell, and Jing Huang

pp. 274-289

The Ultimate Categorical Independence Ratio of a Graph

Jason I. Brown, Richard J. Nowakowski, and Douglas Rall

pp. 290-300

Random Walks on Regular and Irregular Graphs

Don Coppersmith, Uriel Feige, and James Shearer

pp. 301-308

The $L(2,1)$-Labeling Problem on Graphs

Gerard J. Chang and David Kuo

pp. 309-316

Realizing Degree Sequences in Parallel

Srinivasa R. Arikati and Anil Maheshwari

pp. 317-338

The Total Interval Number of a Graph II: Trees and Complexity

Thomas M. Kratzke and Douglas B. West

pp. 339-348